The knapsack problem under uncertainty
نویسنده
چکیده
In this paper we consider the Knapsack Problem under Uncertainty (KPu). Given a container, the knapsack, characterized by a maximum weight that can be accommodated into and a set of items with given weight and random profit, KPu aims to define the subset of items that can be accommodated into the knapsack such that the sum of the weights of the loaded items does not exceed the knapsack maximum weight, while maximizing the expected value of the total profit of the loaded items. Differently from other papers, where the probability distribution of the profits is known in advance [1], we assume that this distribution is not known a priori, because the random profits are extremely difficult to be measured and it would be rather arbitrary to assume a particular shape for their distribution. Lower and upper bounds based on a deterministic approximation of the stochastic problem are presented. In more details, this approximation is obtained by extending the method presented in [2] and using the method of the asymptotic approximations coming from the extreme values theory. Extensive computational results show the effectiveness of the proposed approach.
منابع مشابه
A Robust Knapsack Based Constrained Portfolio Optimization
Many portfolio optimization problems deal with allocation of assets which carry a relatively high market price. Therefore, it is necessary to determine the integer value of assets when we deal with portfolio optimization. In addition, one of the main concerns with most portfolio optimization is associated with the type of constraints considered in different models. In many cases, the resulted p...
متن کاملKnapsack Problem with Uncertain Weights and Values
In this paper, the knapsack problem under uncertain environment is investigated, in which the weights and the values are assumed to be uncertain variables. With different criteria, three mathematical models are constructed for the problem, i.e., expected value model, chance-constrained programming model and uncertain measure model. Taking advantage of uncertainty theory, the first two models ca...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملThe Multi-Handler Knapsack Problem under Uncertainty
The Multi-Handler Knapsack Problem under Uncertainty (MHKPu) is a new stochastic knapsack problem where, given a set of items, characterized by volume and random profit, and a set of potential handlers, we want to find a subset of items which maximizes the expected total profit. The item profit is given by the sum of a deterministic profit plus a stochastic profit due to the random handling cos...
متن کاملAPPROXIMATE ALGORITHM FOR THE MULTI-DIMENSIONAL KNAPSACK PROBLEM BY USING MULTIPLE CRITERIA DECISION MAKING
In this paper, an interesting and easy method to solve the multi-dimensional knapsack problem is presented. Although it belongs to the combinatorial optimization, but the proposed method belongs to the decision making field in mathematics. In order to, initially efficiency values for every item is calculated then items are ranked by using Multiple Criteria Decision Making (MCDA). Finally, ite...
متن کامل